Sparse Object Representations by Digital Distance Functions
Identifieur interne : 002630 ( Main/Exploration ); précédent : 002629; suivant : 002631Sparse Object Representations by Digital Distance Functions
Auteurs : Robin Strand [Suède]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In this paper, some methods for representing objects using path-based distances are considered. The representations can be used as anchor points when extracting medial representations of the objects. The distance transform (DT) is obtained by labeling each object element with the distance to the background. By local operations on the DT, different sets of anchor points can be obtained. We present two different methods based on local operations and prove that the representations are reversible, when this is the case. The methods are defined for weighted distances based on neighborhood sequences, which includes for example the well known cityblock and chessboard distances.
Url:
DOI: 10.1007/978-3-642-19867-0_18
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001319
- to stream Istex, to step Curation: 001302
- to stream Istex, to step Checkpoint: 000530
- to stream Main, to step Merge: 002672
- to stream Main, to step Curation: 002630
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Sparse Object Representations by Digital Distance Functions</title><author><name sortKey="Strand, Robin" sort="Strand, Robin" uniqKey="Strand R" first="Robin" last="Strand">Robin Strand</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5222C9705F28DCDE46DA1D3FE1984269D51B37D4</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-19867-0_18</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-86J7C7F4-P/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001319</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001319</idno><idno type="wicri:Area/Istex/Curation">001302</idno><idno type="wicri:Area/Istex/Checkpoint">000530</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000530</idno><idno type="wicri:doubleKey">0302-9743:2011:Strand R:sparse:object:representations</idno><idno type="wicri:Area/Main/Merge">002672</idno><idno type="wicri:Area/Main/Curation">002630</idno><idno type="wicri:Area/Main/Exploration">002630</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Sparse Object Representations by Digital Distance Functions</title><author><name sortKey="Strand, Robin" sort="Strand, Robin" uniqKey="Strand R" first="Robin" last="Strand">Robin Strand</name><affiliation wicri:level="4"><country xml:lang="fr">Suède</country><wicri:regionArea>Centre for Image Analysis, Uppsala University</wicri:regionArea><placeName><settlement type="city">Uppsala</settlement><region nuts="1">Svealand</region><region nuts="1">East Middle Sweden</region></placeName><orgName type="university">Université d'Uppsala</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Suède</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper, some methods for representing objects using path-based distances are considered. The representations can be used as anchor points when extracting medial representations of the objects. The distance transform (DT) is obtained by labeling each object element with the distance to the background. By local operations on the DT, different sets of anchor points can be obtained. We present two different methods based on local operations and prove that the representations are reversible, when this is the case. The methods are defined for weighted distances based on neighborhood sequences, which includes for example the well known cityblock and chessboard distances.</div></front></TEI><affiliations><list><country><li>Suède</li></country><region><li>East Middle Sweden</li><li>Svealand</li></region><settlement><li>Uppsala</li></settlement><orgName><li>Université d'Uppsala</li></orgName></list><tree><country name="Suède"><region name="Svealand"><name sortKey="Strand, Robin" sort="Strand, Robin" uniqKey="Strand R" first="Robin" last="Strand">Robin Strand</name></region><name sortKey="Strand, Robin" sort="Strand, Robin" uniqKey="Strand R" first="Robin" last="Strand">Robin Strand</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002630 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002630 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:5222C9705F28DCDE46DA1D3FE1984269D51B37D4
|texte= Sparse Object Representations by Digital Distance Functions
}}
| This area was generated with Dilib version V0.6.33. |  |